0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command    : run_E %s %d THM
0.13/0.34	% Computer : n022.cluster.edu
0.13/0.34	% Model    : x86_64 x86_64
0.13/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory   : 8042.1875MB
0.13/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 960
0.13/0.34	% WCLimit    : 120
0.13/0.34	% DateTime   : Tue Aug  9 06:22:31 EDT 2022
0.13/0.34	% CPUTime    : 
0.20/0.46	Running higher-order on 8 cores theorem proving
0.20/0.46	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p
0.20/0.46	# Version: 3.0pre003-ho
1.51/0.65	# Preprocessing class: HSSSSLSSSLSNFFN.
1.51/0.65	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
1.51/0.65	# Starting lpo6_lambda_fix with 600s (5) cores
1.51/0.65	# Starting post_as_ho8 with 120s (1) cores
1.51/0.65	# Starting post_as_ho3 with 120s (1) cores
1.51/0.65	# Starting post_as_ho2 with 120s (1) cores
1.51/0.65	# lpo6_lambda_fix with pid 31763 completed with status 0
1.51/0.65	# Result found by lpo6_lambda_fix
1.51/0.65	# Preprocessing class: HSSSSLSSSLSNFFN.
1.51/0.65	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
1.51/0.65	# Starting lpo6_lambda_fix with 600s (5) cores
1.51/0.65	# No SInE strategy applied
1.51/0.65	# Search class: HGUSF-FFSF32-SFFFMFNN
1.51/0.65	# Scheduled 5 strats onto 5 cores with 600 seconds (600 total)
1.51/0.65	# Starting new_ho_10 with 361s (1) cores
1.51/0.65	# Starting sh5l with 61s (1) cores
1.51/0.65	# Starting sh3l with 61s (1) cores
1.51/0.65	# Starting ehoh_best3_rw with 61s (1) cores
1.51/0.65	# Starting lpo6_lambda_fix with 56s (1) cores
1.51/0.65	# sh3l with pid 31777 completed with status 0
1.51/0.65	# Result found by sh3l
1.51/0.65	# Preprocessing class: HSSSSLSSSLSNFFN.
1.51/0.65	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
1.51/0.65	# Starting lpo6_lambda_fix with 600s (5) cores
1.51/0.65	# No SInE strategy applied
1.51/0.65	# Search class: HGUSF-FFSF32-SFFFMFNN
1.51/0.65	# Scheduled 5 strats onto 5 cores with 600 seconds (600 total)
1.51/0.65	# Starting new_ho_10 with 361s (1) cores
1.51/0.65	# Starting sh5l with 61s (1) cores
1.51/0.65	# Starting sh3l with 61s (1) cores
1.51/0.65	# Preprocessing time       : 0.002 s
1.51/0.65	# Presaturation interreduction done
1.51/0.65	
1.51/0.65	# Proof found!
1.51/0.65	# SZS status Theorem
1.51/0.65	# SZS output start CNFRefutation
1.51/0.65	thf(decl_22, type, in: $i > $i > $o).
1.51/0.65	thf(decl_23, type, subset: $i > $i > $o).
1.51/0.65	thf(decl_24, type, setextsub: $o).
1.51/0.65	thf(decl_25, type, binunion: $i > $i > $i).
1.51/0.65	thf(decl_26, type, kpair: $i > $i > $i).
1.51/0.65	thf(decl_27, type, breln1: $i > $i > $o).
1.51/0.65	thf(decl_28, type, subbreln1: $o).
1.51/0.65	thf(decl_29, type, breln1unionprop: $o).
1.51/0.65	thf(decl_30, type, breln1unionIL: $o).
1.51/0.65	thf(decl_31, type, breln1unionIR: $o).
1.51/0.65	thf(decl_32, type, breln1unionE: $o).
1.51/0.65	thf(decl_33, type, esk1_3: $i > $i > $i > $i).
1.51/0.65	thf(decl_34, type, esk2_3: $i > $i > $i > $i).
1.51/0.65	thf(decl_35, type, esk3_0: $i).
1.51/0.65	thf(decl_36, type, esk4_0: $i).
1.51/0.65	thf(decl_37, type, esk5_0: $i).
1.51/0.65	thf(breln1unionCommutes, conjecture, (((subbreln1)=>((((breln1unionIR)=>((breln1unionE)=>![X1:$i, X3:$i]:((![X4:$i]:(((breln1 @ X1 @ X4)=>((binunion @ X3 @ X4)=(binunion @ X4 @ X3))))<=(breln1 @ X1 @ X3)))))<=(breln1unionIL))<=(breln1unionprop)))<=(setextsub)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', breln1unionCommutes)).
1.51/0.65	thf(setextsub, axiom, ((setextsub)<=>![X1:$i, X2:$i]:(((subset @ X1 @ X2)=>((subset @ X2 @ X1)=>((X1)=(X2)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', setextsub)).
1.51/0.65	thf(subbreln1, axiom, ((subbreln1)<=>![X1:$i, X3:$i]:(((breln1 @ X1 @ X3)=>![X4:$i]:(((breln1 @ X1 @ X4)=>(![X5:$i]:(((in @ X5 @ X1)=>![X6:$i]:(((in @ X6 @ X1)=>((in @ (kpair @ X5 @ X6) @ X3)=>(in @ (kpair @ X5 @ X6) @ X4))))))=>(subset @ X3 @ X4))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', subbreln1)).
1.51/0.65	thf(breln1unionprop, axiom, ((breln1unionprop)<=>![X1:$i, X3:$i]:(((breln1 @ X1 @ X3)=>![X4:$i]:(((breln1 @ X1 @ X4)=>(breln1 @ X1 @ (binunion @ X3 @ X4))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', breln1unionprop)).
1.51/0.65	thf(breln1unionIL, axiom, ((breln1unionIL)<=>![X1:$i, X3:$i]:(((breln1 @ X1 @ X3)=>![X4:$i]:(((breln1 @ X1 @ X4)=>![X5:$i]:(((in @ X5 @ X1)=>![X6:$i]:(((in @ X6 @ X1)=>((in @ (kpair @ X5 @ X6) @ X3)=>(in @ (kpair @ X5 @ X6) @ (binunion @ X3 @ X4)))))))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', breln1unionIL)).
1.51/0.65	thf(breln1unionIR, axiom, ((breln1unionIR)<=>![X1:$i, X3:$i]:(((breln1 @ X1 @ X3)=>![X4:$i]:(((breln1 @ X1 @ X4)=>![X5:$i]:(((in @ X5 @ X1)=>![X6:$i]:(((in @ X6 @ X1)=>((in @ (kpair @ X5 @ X6) @ X4)=>(in @ (kpair @ X5 @ X6) @ (binunion @ X3 @ X4)))))))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', breln1unionIR)).
1.51/0.65	thf(breln1unionE, axiom, ((breln1unionE)<=>![X1:$i, X3:$i]:(((breln1 @ X1 @ X3)=>![X4:$i]:(((breln1 @ X1 @ X4)=>![X5:$i]:(((in @ X5 @ X1)=>![X6:$i]:(((in @ X6 @ X1)=>((in @ (kpair @ X5 @ X6) @ (binunion @ X3 @ X4))=>((in @ (kpair @ X5 @ X6) @ X3)|(in @ (kpair @ X5 @ X6) @ X4)))))))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', breln1unionE)).
1.51/0.65	thf(c_0_7, negated_conjecture, ~((![X58:$i, X59:$i]:(((subset @ X58 @ X59)=>((subset @ X59 @ X58)=>((X58)=(X59)))))=>(![X35:$i, X36:$i]:(((breln1 @ X35 @ X36)=>![X37:$i]:(((breln1 @ X35 @ X37)=>(![X38:$i]:(((in @ X38 @ X35)=>![X39:$i]:(((in @ X39 @ X35)=>((in @ (kpair @ X38 @ X39) @ X36)=>(in @ (kpair @ X38 @ X39) @ X37))))))=>(subset @ X36 @ X37))))))=>(![X55:$i, X56:$i]:(((breln1 @ X55 @ X56)=>![X57:$i]:(((breln1 @ X55 @ X57)=>(breln1 @ X55 @ (binunion @ X56 @ X57))))))=>(![X50:$i, X51:$i]:(((breln1 @ X50 @ X51)=>![X52:$i]:(((breln1 @ X50 @ X52)=>![X53:$i]:(((in @ X53 @ X50)=>![X54:$i]:(((in @ X54 @ X50)=>((in @ (kpair @ X53 @ X54) @ X51)=>(in @ (kpair @ X53 @ X54) @ (binunion @ X51 @ X52)))))))))))=>(![X40:$i, X41:$i]:(((breln1 @ X40 @ X41)=>![X42:$i]:(((breln1 @ X40 @ X42)=>![X43:$i]:(((in @ X43 @ X40)=>![X44:$i]:(((in @ X44 @ X40)=>((in @ (kpair @ X43 @ X44) @ X42)=>(in @ (kpair @ X43 @ X44) @ (binunion @ X41 @ X42)))))))))))=>(![X45:$i, X46:$i]:(((breln1 @ X45 @ X46)=>![X47:$i]:(((breln1 @ X45 @ X47)=>![X48:$i]:(((in @ X48 @ X45)=>![X49:$i]:(((in @ X49 @ X45)=>((in @ (kpair @ X48 @ X49) @ (binunion @ X46 @ X47))=>((in @ (kpair @ X48 @ X49) @ X46)|(in @ (kpair @ X48 @ X49) @ X47)))))))))))=>![X1:$i, X3:$i]:(((breln1 @ X1 @ X3)=>![X4:$i]:(((breln1 @ X1 @ X4)=>((binunion @ X3 @ X4)=(binunion @ X4 @ X3))))))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[breln1unionCommutes]), setextsub]), subbreln1]), breln1unionprop]), breln1unionIL]), breln1unionIR]), breln1unionE])])).
1.51/0.65	thf(c_0_8, negated_conjecture, ![X60:$i, X61:$i, X62:$i, X63:$i, X64:$i, X67:$i, X68:$i, X69:$i, X70:$i, X71:$i, X72:$i, X73:$i, X74:$i, X75:$i, X76:$i, X77:$i, X78:$i, X79:$i, X80:$i, X81:$i, X82:$i, X83:$i, X84:$i]:(((~(subset @ X60 @ X61)|(~(subset @ X61 @ X60)|((X60)=(X61))))&((((in @ (esk1_3 @ X62 @ X63 @ X64) @ X62)|(subset @ X63 @ X64)|~(breln1 @ X62 @ X64)|~(breln1 @ X62 @ X63))&(((in @ (esk2_3 @ X62 @ X63 @ X64) @ X62)|(subset @ X63 @ X64)|~(breln1 @ X62 @ X64)|~(breln1 @ X62 @ X63))&(((in @ (kpair @ (esk1_3 @ X62 @ X63 @ X64) @ (esk2_3 @ X62 @ X63 @ X64)) @ X63)|(subset @ X63 @ X64)|~(breln1 @ X62 @ X64)|~(breln1 @ X62 @ X63))&(~(in @ (kpair @ (esk1_3 @ X62 @ X63 @ X64) @ (esk2_3 @ X62 @ X63 @ X64)) @ X64)|(subset @ X63 @ X64)|~(breln1 @ X62 @ X64)|~(breln1 @ X62 @ X63)))))&((~(breln1 @ X67 @ X68)|(~(breln1 @ X67 @ X69)|(breln1 @ X67 @ (binunion @ X68 @ X69))))&((~(breln1 @ X70 @ X71)|(~(breln1 @ X70 @ X72)|(~(in @ X73 @ X70)|(~(in @ X74 @ X70)|(~(in @ (kpair @ X73 @ X74) @ X71)|(in @ (kpair @ X73 @ X74) @ (binunion @ X71 @ X72)))))))&((~(breln1 @ X75 @ X76)|(~(breln1 @ X75 @ X77)|(~(in @ X78 @ X75)|(~(in @ X79 @ X75)|(~(in @ (kpair @ X78 @ X79) @ X77)|(in @ (kpair @ X78 @ X79) @ (binunion @ X76 @ X77)))))))&((~(breln1 @ X80 @ X81)|(~(breln1 @ X80 @ X82)|(~(in @ X83 @ X80)|(~(in @ X84 @ X80)|(~(in @ (kpair @ X83 @ X84) @ (binunion @ X81 @ X82))|((in @ (kpair @ X83 @ X84) @ X81)|(in @ (kpair @ X83 @ X84) @ X82)))))))&((breln1 @ esk3_0 @ esk4_0)&((breln1 @ esk3_0 @ esk5_0)&((binunion @ esk4_0 @ esk5_0)!=(binunion @ esk5_0 @ esk4_0))))))))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])])).
1.51/0.65	thf(c_0_9, negated_conjecture, ![X1:$i, X3:$i, X5:$i, X4:$i, X2:$i]:(((in @ (kpair @ X4 @ X5) @ (binunion @ X2 @ X3))|~((breln1 @ X1 @ X2))|~((breln1 @ X1 @ X3))|~((in @ X4 @ X1))|~((in @ X5 @ X1))|~((in @ (kpair @ X4 @ X5) @ X2)))), inference(split_conjunct,[status(thm)],[c_0_8])).
1.51/0.65	thf(c_0_10, negated_conjecture, (breln1 @ esk3_0 @ esk5_0), inference(split_conjunct,[status(thm)],[c_0_8])).
1.51/0.65	thf(c_0_11, negated_conjecture, ![X1:$i, X2:$i, X5:$i, X4:$i, X3:$i]:(((in @ (kpair @ X4 @ X5) @ X2)|(in @ (kpair @ X4 @ X5) @ X3)|~((breln1 @ X1 @ X2))|~((breln1 @ X1 @ X3))|~((in @ X4 @ X1))|~((in @ X5 @ X1))|~((in @ (kpair @ X4 @ X5) @ (binunion @ X2 @ X3))))), inference(split_conjunct,[status(thm)],[c_0_8])).
1.51/0.65	thf(c_0_12, negated_conjecture, ![X1:$i, X3:$i, X2:$i]:(((in @ (kpair @ (esk1_3 @ X1 @ X2 @ X3) @ (esk2_3 @ X1 @ X2 @ X3)) @ X2)|(subset @ X2 @ X3)|~((breln1 @ X1 @ X3))|~((breln1 @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_8])).
1.51/0.65	thf(c_0_13, negated_conjecture, ![X1:$i, X3:$i, X2:$i]:(((subset @ X2 @ X3)|~((in @ (kpair @ (esk1_3 @ X1 @ X2 @ X3) @ (esk2_3 @ X1 @ X2 @ X3)) @ X3))|~((breln1 @ X1 @ X3))|~((breln1 @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_8])).
1.51/0.65	thf(c_0_14, negated_conjecture, ![X1:$i, X2:$i, X3:$i]:(((in @ (kpair @ X1 @ X2) @ (binunion @ X3 @ esk5_0))|~((in @ (kpair @ X1 @ X2) @ X3))|~((in @ X2 @ esk3_0))|~((in @ X1 @ esk3_0))|~((breln1 @ esk3_0 @ X3)))), inference(spm,[status(thm)],[c_0_9, c_0_10])).
1.51/0.65	thf(c_0_15, negated_conjecture, ![X1:$i, X3:$i, X2:$i, X5:$i, X4:$i]:(((in @ (kpair @ (esk1_3 @ X1 @ (binunion @ X2 @ X3) @ X4) @ (esk2_3 @ X1 @ (binunion @ X2 @ X3) @ X4)) @ X2)|(in @ (kpair @ (esk1_3 @ X1 @ (binunion @ X2 @ X3) @ X4) @ (esk2_3 @ X1 @ (binunion @ X2 @ X3) @ X4)) @ X3)|(subset @ (binunion @ X2 @ X3) @ X4)|~((in @ (esk2_3 @ X1 @ (binunion @ X2 @ X3) @ X4) @ X5))|~((in @ (esk1_3 @ X1 @ (binunion @ X2 @ X3) @ X4) @ X5))|~((breln1 @ X1 @ (binunion @ X2 @ X3)))|~((breln1 @ X5 @ X3))|~((breln1 @ X5 @ X2))|~((breln1 @ X1 @ X4)))), inference(spm,[status(thm)],[c_0_11, c_0_12])).
1.51/0.65	thf(c_0_16, negated_conjecture, ![X1:$i, X3:$i, X2:$i]:(((in @ (esk2_3 @ X1 @ X2 @ X3) @ X1)|(subset @ X2 @ X3)|~((breln1 @ X1 @ X3))|~((breln1 @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_8])).
1.51/0.65	thf(c_0_17, negated_conjecture, ![X1:$i, X2:$i, X3:$i]:(((breln1 @ X1 @ (binunion @ X2 @ X3))|~((breln1 @ X1 @ X2))|~((breln1 @ X1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_8])).
1.51/0.65	thf(c_0_18, negated_conjecture, ![X3:$i, X2:$i, X1:$i]:(((subset @ X1 @ (binunion @ X2 @ esk5_0))|~((in @ (kpair @ (esk1_3 @ X3 @ X1 @ (binunion @ X2 @ esk5_0)) @ (esk2_3 @ X3 @ X1 @ (binunion @ X2 @ esk5_0))) @ X2))|~((in @ (esk2_3 @ X3 @ X1 @ (binunion @ X2 @ esk5_0)) @ esk3_0))|~((in @ (esk1_3 @ X3 @ X1 @ (binunion @ X2 @ esk5_0)) @ esk3_0))|~((breln1 @ X3 @ (binunion @ X2 @ esk5_0)))|~((breln1 @ esk3_0 @ X2))|~((breln1 @ X3 @ X1)))), inference(spm,[status(thm)],[c_0_13, c_0_14])).
1.51/0.65	thf(c_0_19, negated_conjecture, ![X1:$i, X3:$i, X2:$i, X4:$i]:(((in @ (kpair @ (esk1_3 @ X1 @ (binunion @ X2 @ X3) @ X4) @ (esk2_3 @ X1 @ (binunion @ X2 @ X3) @ X4)) @ X3)|(in @ (kpair @ (esk1_3 @ X1 @ (binunion @ X2 @ X3) @ X4) @ (esk2_3 @ X1 @ (binunion @ X2 @ X3) @ X4)) @ X2)|(subset @ (binunion @ X2 @ X3) @ X4)|~((in @ (esk1_3 @ X1 @ (binunion @ X2 @ X3) @ X4) @ X1))|~((breln1 @ X1 @ X3))|~((breln1 @ X1 @ X2))|~((breln1 @ X1 @ X4)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_17])).
1.51/0.65	thf(c_0_20, negated_conjecture, ![X1:$i, X3:$i, X2:$i]:(((in @ (esk1_3 @ X1 @ X2 @ X3) @ X1)|(subset @ X2 @ X3)|~((breln1 @ X1 @ X3))|~((breln1 @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_8])).
1.51/0.65	thf(c_0_21, negated_conjecture, ![X2:$i, X1:$i]:(((subset @ X1 @ (binunion @ X1 @ esk5_0))|~((in @ (esk2_3 @ X2 @ X1 @ (binunion @ X1 @ esk5_0)) @ esk3_0))|~((in @ (esk1_3 @ X2 @ X1 @ (binunion @ X1 @ esk5_0)) @ esk3_0))|~((breln1 @ X2 @ (binunion @ X1 @ esk5_0)))|~((breln1 @ esk3_0 @ X1))|~((breln1 @ X2 @ X1)))), inference(spm,[status(thm)],[c_0_18, c_0_12])).
1.51/0.65	thf(c_0_22, negated_conjecture, ![X1:$i, X3:$i, X2:$i, X4:$i]:(((in @ (kpair @ (esk1_3 @ X1 @ (binunion @ X2 @ X3) @ X4) @ (esk2_3 @ X1 @ (binunion @ X2 @ X3) @ X4)) @ X2)|(in @ (kpair @ (esk1_3 @ X1 @ (binunion @ X2 @ X3) @ X4) @ (esk2_3 @ X1 @ (binunion @ X2 @ X3) @ X4)) @ X3)|(subset @ (binunion @ X2 @ X3) @ X4)|~((breln1 @ X1 @ X3))|~((breln1 @ X1 @ X2))|~((breln1 @ X1 @ X4)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_20]), c_0_17])).
1.51/0.65	thf(c_0_23, negated_conjecture, (breln1 @ esk3_0 @ esk4_0), inference(split_conjunct,[status(thm)],[c_0_8])).
1.51/0.65	thf(c_0_24, negated_conjecture, ![X2:$i, X1:$i, X5:$i, X4:$i, X3:$i]:(((in @ (kpair @ X4 @ X5) @ (binunion @ X2 @ X3))|~((breln1 @ X1 @ X2))|~((breln1 @ X1 @ X3))|~((in @ X4 @ X1))|~((in @ X5 @ X1))|~((in @ (kpair @ X4 @ X5) @ X3)))), inference(split_conjunct,[status(thm)],[c_0_8])).
1.51/0.65	thf(c_0_25, negated_conjecture, ![X1:$i]:(((subset @ X1 @ (binunion @ X1 @ esk5_0))|~((breln1 @ esk3_0 @ (binunion @ X1 @ esk5_0)))|~((breln1 @ esk3_0 @ X1)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_16]), c_0_20])).
1.51/0.65	thf(c_0_26, negated_conjecture, ![X1:$i, X2:$i]:(((in @ (kpair @ (esk1_3 @ esk3_0 @ (binunion @ X1 @ esk5_0) @ X2) @ (esk2_3 @ esk3_0 @ (binunion @ X1 @ esk5_0) @ X2)) @ esk5_0)|(in @ (kpair @ (esk1_3 @ esk3_0 @ (binunion @ X1 @ esk5_0) @ X2) @ (esk2_3 @ esk3_0 @ (binunion @ X1 @ esk5_0) @ X2)) @ X1)|(subset @ (binunion @ X1 @ esk5_0) @ X2)|~((breln1 @ esk3_0 @ X1))|~((breln1 @ esk3_0 @ X2)))), inference(spm,[status(thm)],[c_0_22, c_0_10])).
1.51/0.65	thf(c_0_27, negated_conjecture, ![X1:$i, X2:$i, X3:$i]:(((in @ (kpair @ X1 @ X2) @ (binunion @ X3 @ esk4_0))|~((in @ (kpair @ X1 @ X2) @ X3))|~((in @ X2 @ esk3_0))|~((in @ X1 @ esk3_0))|~((breln1 @ esk3_0 @ X3)))), inference(spm,[status(thm)],[c_0_9, c_0_23])).
1.51/0.65	thf(c_0_28, negated_conjecture, ![X1:$i, X2:$i, X3:$i, X6:$i, X5:$i, X4:$i]:(((in @ (kpair @ X1 @ X2) @ (binunion @ X3 @ (binunion @ X4 @ X5)))|~((in @ (kpair @ X1 @ X2) @ (binunion @ X4 @ X5)))|~((in @ X2 @ X6))|~((in @ X1 @ X6))|~((breln1 @ X6 @ X3))|~((breln1 @ X6 @ X5))|~((breln1 @ X6 @ X4)))), inference(spm,[status(thm)],[c_0_24, c_0_17])).
1.51/0.65	thf(c_0_29, negated_conjecture, ![X2:$i, X1:$i]:((((X1)=(X2))|~((subset @ X1 @ X2))|~((subset @ X2 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_8])).
1.51/0.65	thf(c_0_30, negated_conjecture, ![X1:$i]:(((subset @ X1 @ (binunion @ X1 @ esk5_0))|~((breln1 @ esk3_0 @ X1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_17]), c_0_10])])).
1.51/0.65	thf(c_0_31, negated_conjecture, ![X1:$i]:(((in @ (kpair @ (esk1_3 @ esk3_0 @ (binunion @ esk5_0 @ esk5_0) @ X1) @ (esk2_3 @ esk3_0 @ (binunion @ esk5_0 @ esk5_0) @ X1)) @ esk5_0)|(subset @ (binunion @ esk5_0 @ esk5_0) @ X1)|~((breln1 @ esk3_0 @ X1)))), inference(spm,[status(thm)],[c_0_26, c_0_10])).
1.51/0.65	thf(c_0_32, negated_conjecture, ![X1:$i, X2:$i, X3:$i]:(((in @ (kpair @ X1 @ X2) @ (binunion @ X3 @ esk4_0))|~((in @ (kpair @ X1 @ X2) @ esk4_0))|~((in @ X2 @ esk3_0))|~((in @ X1 @ esk3_0))|~((breln1 @ esk3_0 @ X3)))), inference(spm,[status(thm)],[c_0_24, c_0_23])).
1.51/0.65	thf(c_0_33, negated_conjecture, ![X3:$i, X2:$i, X1:$i]:(((subset @ X1 @ (binunion @ X2 @ esk4_0))|~((in @ (kpair @ (esk1_3 @ X3 @ X1 @ (binunion @ X2 @ esk4_0)) @ (esk2_3 @ X3 @ X1 @ (binunion @ X2 @ esk4_0))) @ X2))|~((in @ (esk2_3 @ X3 @ X1 @ (binunion @ X2 @ esk4_0)) @ esk3_0))|~((in @ (esk1_3 @ X3 @ X1 @ (binunion @ X2 @ esk4_0)) @ esk3_0))|~((breln1 @ X3 @ (binunion @ X2 @ esk4_0)))|~((breln1 @ esk3_0 @ X2))|~((breln1 @ X3 @ X1)))), inference(spm,[status(thm)],[c_0_13, c_0_27])).
1.51/0.65	thf(c_0_34, negated_conjecture, ![X1:$i]:(((in @ (kpair @ (esk1_3 @ esk3_0 @ (binunion @ esk4_0 @ esk5_0) @ X1) @ (esk2_3 @ esk3_0 @ (binunion @ esk4_0 @ esk5_0) @ X1)) @ esk4_0)|(in @ (kpair @ (esk1_3 @ esk3_0 @ (binunion @ esk4_0 @ esk5_0) @ X1) @ (esk2_3 @ esk3_0 @ (binunion @ esk4_0 @ esk5_0) @ X1)) @ esk5_0)|(subset @ (binunion @ esk4_0 @ esk5_0) @ X1)|~((breln1 @ esk3_0 @ X1)))), inference(spm,[status(thm)],[c_0_26, c_0_23])).
1.51/0.65	thf(c_0_35, negated_conjecture, ![X1:$i, X2:$i, X4:$i, X3:$i]:(((in @ (kpair @ X1 @ X2) @ (binunion @ esk4_0 @ (binunion @ X3 @ X4)))|~((in @ (kpair @ X1 @ X2) @ (binunion @ X3 @ X4)))|~((in @ X2 @ esk3_0))|~((in @ X1 @ esk3_0))|~((breln1 @ esk3_0 @ X4))|~((breln1 @ esk3_0 @ X3)))), inference(spm,[status(thm)],[c_0_28, c_0_23])).
1.51/0.65	thf(c_0_36, negated_conjecture, ![X1:$i]:((((binunion @ X1 @ esk5_0)=(X1))|~((subset @ (binunion @ X1 @ esk5_0) @ X1))|~((breln1 @ esk3_0 @ X1)))), inference(spm,[status(thm)],[c_0_29, c_0_30])).
1.51/0.65	thf(c_0_37, negated_conjecture, ((subset @ (binunion @ esk5_0 @ esk5_0) @ esk5_0)|~((breln1 @ esk3_0 @ (binunion @ esk5_0 @ esk5_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_31]), c_0_10])])).
1.51/0.65	thf(c_0_38, negated_conjecture, ![X3:$i, X2:$i, X1:$i]:(((subset @ X1 @ (binunion @ X2 @ esk4_0))|~((in @ (kpair @ (esk1_3 @ X3 @ X1 @ (binunion @ X2 @ esk4_0)) @ (esk2_3 @ X3 @ X1 @ (binunion @ X2 @ esk4_0))) @ esk4_0))|~((in @ (esk2_3 @ X3 @ X1 @ (binunion @ X2 @ esk4_0)) @ esk3_0))|~((in @ (esk1_3 @ X3 @ X1 @ (binunion @ X2 @ esk4_0)) @ esk3_0))|~((breln1 @ X3 @ (binunion @ X2 @ esk4_0)))|~((breln1 @ esk3_0 @ X2))|~((breln1 @ X3 @ X1)))), inference(spm,[status(thm)],[c_0_13, c_0_32])).
1.51/0.65	thf(c_0_39, negated_conjecture, ((in @ (kpair @ (esk1_3 @ esk3_0 @ (binunion @ esk4_0 @ esk5_0) @ (binunion @ esk5_0 @ esk4_0)) @ (esk2_3 @ esk3_0 @ (binunion @ esk4_0 @ esk5_0) @ (binunion @ esk5_0 @ esk4_0))) @ esk4_0)|(subset @ (binunion @ esk4_0 @ esk5_0) @ (binunion @ esk5_0 @ esk4_0))|~((breln1 @ esk3_0 @ (binunion @ esk5_0 @ esk4_0)))|~((breln1 @ esk3_0 @ (binunion @ esk4_0 @ esk5_0)))), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_34]), c_0_10])]), c_0_20]), c_0_16])).
1.51/0.65	thf(c_0_40, negated_conjecture, ![X2:$i, X4:$i, X3:$i, X1:$i]:(((subset @ X1 @ (binunion @ esk4_0 @ (binunion @ X2 @ X3)))|~((in @ (kpair @ (esk1_3 @ X4 @ X1 @ (binunion @ esk4_0 @ (binunion @ X2 @ X3))) @ (esk2_3 @ X4 @ X1 @ (binunion @ esk4_0 @ (binunion @ X2 @ X3)))) @ (binunion @ X2 @ X3)))|~((in @ (esk2_3 @ X4 @ X1 @ (binunion @ esk4_0 @ (binunion @ X2 @ X3))) @ esk3_0))|~((in @ (esk1_3 @ X4 @ X1 @ (binunion @ esk4_0 @ (binunion @ X2 @ X3))) @ esk3_0))|~((breln1 @ X4 @ (binunion @ esk4_0 @ (binunion @ X2 @ X3))))|~((breln1 @ esk3_0 @ X3))|~((breln1 @ esk3_0 @ X2))|~((breln1 @ X4 @ X1)))), inference(spm,[status(thm)],[c_0_13, c_0_35])).
1.51/0.65	thf(c_0_41, negated_conjecture, ![X1:$i, X2:$i]:(((in @ (kpair @ (esk1_3 @ esk3_0 @ (binunion @ X1 @ esk4_0) @ X2) @ (esk2_3 @ esk3_0 @ (binunion @ X1 @ esk4_0) @ X2)) @ esk4_0)|(in @ (kpair @ (esk1_3 @ esk3_0 @ (binunion @ X1 @ esk4_0) @ X2) @ (esk2_3 @ esk3_0 @ (binunion @ X1 @ esk4_0) @ X2)) @ X1)|(subset @ (binunion @ X1 @ esk4_0) @ X2)|~((breln1 @ esk3_0 @ X1))|~((breln1 @ esk3_0 @ X2)))), inference(spm,[status(thm)],[c_0_22, c_0_23])).
1.51/0.65	thf(c_0_42, negated_conjecture, (((binunion @ esk5_0 @ esk5_0)=(esk5_0))|~((breln1 @ esk3_0 @ (binunion @ esk5_0 @ esk5_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_37]), c_0_10])])).
1.51/0.65	thf(c_0_43, negated_conjecture, ((subset @ (binunion @ esk4_0 @ esk5_0) @ (binunion @ esk5_0 @ esk4_0))|~((breln1 @ esk3_0 @ (binunion @ esk5_0 @ esk4_0)))|~((breln1 @ esk3_0 @ (binunion @ esk4_0 @ esk5_0)))), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38, c_0_39]), c_0_10])]), c_0_20]), c_0_16])).
1.51/0.65	thf(c_0_44, negated_conjecture, ((binunion @ esk4_0 @ esk5_0)!=(binunion @ esk5_0 @ esk4_0)), inference(split_conjunct,[status(thm)],[c_0_8])).
1.51/0.65	thf(c_0_45, negated_conjecture, ![X3:$i, X2:$i, X1:$i]:(((subset @ X1 @ (binunion @ esk4_0 @ (binunion @ X2 @ esk5_0)))|~((in @ (kpair @ (esk1_3 @ X3 @ X1 @ (binunion @ esk4_0 @ (binunion @ X2 @ esk5_0))) @ (esk2_3 @ X3 @ X1 @ (binunion @ esk4_0 @ (binunion @ X2 @ esk5_0)))) @ X2))|~((in @ (esk2_3 @ X3 @ X1 @ (binunion @ esk4_0 @ (binunion @ X2 @ esk5_0))) @ esk3_0))|~((in @ (esk1_3 @ X3 @ X1 @ (binunion @ esk4_0 @ (binunion @ X2 @ esk5_0))) @ esk3_0))|~((breln1 @ X3 @ (binunion @ esk4_0 @ (binunion @ X2 @ esk5_0))))|~((breln1 @ esk3_0 @ X2))|~((breln1 @ X3 @ X1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40, c_0_14]), c_0_10])])).
1.51/0.65	thf(c_0_46, negated_conjecture, ![X1:$i]:(((in @ (kpair @ (esk1_3 @ esk3_0 @ (binunion @ esk5_0 @ esk4_0) @ X1) @ (esk2_3 @ esk3_0 @ (binunion @ esk5_0 @ esk4_0) @ X1)) @ esk5_0)|(in @ (kpair @ (esk1_3 @ esk3_0 @ (binunion @ esk5_0 @ esk4_0) @ X1) @ (esk2_3 @ esk3_0 @ (binunion @ esk5_0 @ esk4_0) @ X1)) @ esk4_0)|(subset @ (binunion @ esk5_0 @ esk4_0) @ X1)|~((breln1 @ esk3_0 @ X1)))), inference(spm,[status(thm)],[c_0_41, c_0_10])).
1.51/0.65	thf(c_0_47, negated_conjecture, ((binunion @ esk5_0 @ esk5_0)=(esk5_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42, c_0_17]), c_0_10])])).
1.51/0.65	thf(c_0_48, negated_conjecture, (~((subset @ (binunion @ esk5_0 @ esk4_0) @ (binunion @ esk4_0 @ esk5_0)))|~((breln1 @ esk3_0 @ (binunion @ esk5_0 @ esk4_0)))|~((breln1 @ esk3_0 @ (binunion @ esk4_0 @ esk5_0)))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_43]), c_0_44])).
1.51/0.65	thf(c_0_49, negated_conjecture, ((in @ (kpair @ (esk1_3 @ esk3_0 @ (binunion @ esk5_0 @ esk4_0) @ (binunion @ esk4_0 @ esk5_0)) @ (esk2_3 @ esk3_0 @ (binunion @ esk5_0 @ esk4_0) @ (binunion @ esk4_0 @ esk5_0))) @ esk4_0)|~((breln1 @ esk3_0 @ (binunion @ esk4_0 @ esk5_0)))|~((breln1 @ esk3_0 @ (binunion @ esk5_0 @ esk4_0)))), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45, c_0_46]), c_0_47]), c_0_47]), c_0_47]), c_0_47]), c_0_47]), c_0_47]), c_0_10])]), c_0_20]), c_0_16]), c_0_48])).
1.51/0.65	thf(c_0_50, negated_conjecture, (~((breln1 @ esk3_0 @ (binunion @ esk4_0 @ esk5_0)))|~((breln1 @ esk3_0 @ (binunion @ esk5_0 @ esk4_0)))), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_49]), c_0_23])]), c_0_20]), c_0_16]), c_0_48])).
1.51/0.65	thf(c_0_51, negated_conjecture, ~((breln1 @ esk3_0 @ (binunion @ esk4_0 @ esk5_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50, c_0_17]), c_0_23]), c_0_10])])).
1.51/0.65	thf(c_0_52, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51, c_0_17]), c_0_10]), c_0_23])]), ['proof']).
1.51/0.65	# SZS output end CNFRefutation
1.51/0.65	# Parsed axioms                        : 18
1.51/0.65	# Removed by relevancy pruning/SinE    : 0
1.51/0.65	# Initial clauses                      : 23
1.51/0.65	# Removed in clause preprocessing      : 11
1.51/0.65	# Initial clauses in saturation        : 12
1.51/0.65	# Processed clauses                    : 498
1.51/0.65	# ...of these trivial                  : 19
1.51/0.65	# ...subsumed                          : 118
1.51/0.65	# ...remaining for further processing  : 361
1.51/0.65	# Other redundant clauses eliminated   : 0
1.51/0.65	# Clauses deleted for lack of memory   : 0
1.51/0.65	# Backward-subsumed                    : 57
1.51/0.65	# Backward-rewritten                   : 7
1.51/0.65	# Generated clauses                    : 2498
1.51/0.65	# ...of the previous two non-redundant : 2311
1.51/0.65	# ...aggressively subsumed             : 0
1.51/0.65	# Contextual simplify-reflections      : 44
1.51/0.65	# Paramodulations                      : 2498
1.51/0.65	# Factorizations                       : 0
1.51/0.65	# NegExts                              : 0
1.51/0.65	# Equation resolutions                 : 0
1.51/0.65	# Propositional unsat checks           : 0
1.51/0.65	#    Propositional check models        : 0
1.51/0.65	#    Propositional check unsatisfiable : 0
1.51/0.65	#    Propositional clauses             : 0
1.51/0.65	#    Propositional clauses after purity: 0
1.51/0.65	#    Propositional unsat core size     : 0
1.51/0.65	#    Propositional preprocessing time  : 0.000
1.51/0.65	#    Propositional encoding time       : 0.000
1.51/0.65	#    Propositional solver time         : 0.000
1.51/0.65	#    Success case prop preproc time    : 0.000
1.51/0.65	#    Success case prop encoding time   : 0.000
1.51/0.65	#    Success case prop solver time     : 0.000
1.51/0.65	# Current number of processed clauses  : 285
1.51/0.65	#    Positive orientable unit clauses  : 15
1.51/0.65	#    Positive unorientable unit clauses: 0
1.51/0.65	#    Negative unit clauses             : 2
1.51/0.65	#    Non-unit-clauses                  : 268
1.51/0.65	# Current number of unprocessed clauses: 1807
1.51/0.65	# ...number of literals in the above   : 17620
1.51/0.65	# Current number of archived formulas  : 0
1.51/0.65	# Current number of archived clauses   : 76
1.51/0.65	# Clause-clause subsumption calls (NU) : 32914
1.51/0.65	# Rec. Clause-clause subsumption calls : 4746
1.51/0.65	# Non-unit clause-clause subsumptions  : 210
1.51/0.65	# Unit Clause-clause subsumption calls : 1156
1.51/0.65	# Rewrite failures with RHS unbound    : 0
1.51/0.65	# BW rewrite match attempts            : 18
1.51/0.65	# BW rewrite match successes           : 3
1.51/0.65	# Condensation attempts                : 0
1.51/0.65	# Condensation successes               : 0
1.51/0.65	# Termbank termtop insertions          : 433196
1.51/0.65	
1.51/0.65	# -------------------------------------------------
1.51/0.65	# User time                : 0.167 s
1.51/0.65	# System time              : 0.006 s
1.51/0.65	# Total time               : 0.173 s
1.51/0.65	# Maximum resident set size: 1952 pages
1.51/0.65	
1.51/0.65	# -------------------------------------------------
1.51/0.65	# User time                : 0.831 s
1.51/0.65	# System time              : 0.032 s
1.51/0.65	# Total time               : 0.863 s
1.51/0.65	# Maximum resident set size: 1716 pages
1.51/0.65	EOF
